package test2;

public class demo108 {
/*
    class Solution {
        public List<List<Integer>> permute(int[] nums) {
            List<List<Integer>> result = new LinkedList<>();

            Queue<List> queue = new LinkedList();
            queue.offer(new ArrayList<>());
            while(!queue.isEmpty()){
                List<Integer> node = queue.poll();
                if(nums.length == node.size()){
                    result.add(node);
                }else{
                    for(int val : nums){
                        if(!node.contains(val)){
                            List<Integer> temp = new ArrayList<>(node);
                            temp.add(val);
                            queue.offer(temp);
                        }
                    }
                }
            }
            return result;
        }
    }
*/


}
